import sys
import math
from collections import Counter
from collections import defaultdict
def get_ints(): return list(map(int, sys.stdin.readline().strip().split()))
def get_string(): return sys.stdin.readline().strip()
def solve(arr):
summ = 0
for i in range(len(arr)):
summ += arr[i]
if summ < 0:
return "NO"
if summ == 0:
for j in range(i+1, len(arr)):
if arr[j] != 0:
return "NO"
return "YES"
if summ == 0:
return "YES"
return "NO"
t = int(input())
for _ in range(t):
n = get_ints()
arr = get_ints()
print(solve(arr))
#include <bits/stdc++.h>
using namespace std;
#define int long long int
#define endl "\n"
#define pb push_back
void solve(){
int n;
cin>>n;
int arr[n];
int sum =0;
for(int i=0;i<n;i++){
cin>>arr[i];
sum+=arr[i];
}
if(sum!=0){
cout<<"No"<<endl;
return;
}
int j = n-1;
while(j>=0 && arr[j]==0){
j--;
}
int pre = 0;
for(int i=0;i<j;i++){
pre+=arr[i];
if(pre<=0){
cout<<"No"<<endl;
return;
}
}
cout<<"Yes"<<endl;
}
int32_t main()
{
int t=1;
cin>>t;
while(t--){
solve();
}
return 0;
}
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |